Dual Brep-CSG Collision Detection for General Polyhedra
نویسندگان
چکیده
While almost all collision detection algorithms have been linked to a particular object representation scheme, few attempts have been made using hybrid methods to exploit the advantages of multiple representations of objects. In this paper we present a collision detection algorithm based on a dual b-rep/CSG representation of concave polyhedra initially represented in b-rep. Our method naturally combines the use of bounding volumes, hierarchical subdivision, and space partitioning to perform the interference test. keywords:collision detection, dual b-rep/CSG representation
منابع مشابه
An Adaptive Bounding Object Based Algorithm for Efficient and Precise Collision Detection of Csg-represented Virtual Objects
Collision detection is the foundation of interaction in virtual reality. In Virtual design workspace, virtual assembly workspace, and virtual training, for example, the motion of virtual objects must be constrained by collisions with other objects to provide the sense of reality. Important human-object interactions such as grasping, hitting, moving, etc., in virtual reality (VR) environments ar...
متن کاملCollision Detection of Convex Polyhedra Based on Duality Transformation
Collision detection is an essential problem in many applications in computer graphics, CAD/CAM, and robotics. In this paper, a new method, called CD-Dual, for detecting collision between two convex polyhedra is proposed. The idea is based on a local search among the faces on the Minkowski difference (M) of the polyhedra. The local search is guided by a simple signed distance function defined on...
متن کاملHigh Speed and High Fidelity Visualization of Complex CSG Models
We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As a part of pre-processing, we compute the Brep (boundary representation) from the CSG tree and represent the resulting solid using trimmed spline surfaces. No assumptions are made...
متن کاملBRep-Index: A Multi-Dimensional Space Partitioning Tree
In this paper we introduce the brep-index, a new multi-dimensional space partitioning data structure that provides quick access to the vertices, edges and faces of a boundary representation (brep), thus yielding a single unified representation for polyhedral solids. We d~cribe the cortStruction of the brep-index and show that its size is O(v +e + f), where VI €I and J are the number of vertices...
متن کاملBREP Identification During Voxel-Based Collision Detection for Haptic Manual Assembly
This paper presents a novel method to tie geometric boundary representation (BREP) to voxel-based collision detection for use in haptic manual assembly simulation. Virtual Reality, in particular haptics, has been applied with promising results to improve preliminary product design, assembly prototyping and maintenance operations. However, current methodologies do not provide support for low cle...
متن کامل